The soft-margin Support Vector Machine with ordered weighted average

نویسندگان

چکیده

This paper deals with a cost sensitive extension of the standard Support Vector Machine (SVM) using an ordered weighted sum deviations misclassified individuals respect to their corresponding supporting hyperplanes. In contrast previous heuristic approaches, exact method that applies average operator in classical SVM model is proposed. Specifically, when weights are sorted non-decreasing order, quadratic continuous formulation developed. For general weights, mixed integer addition, our results prove nonlinear kernel functions can be also applied these new models extending its applicability beyond linear case. Extensive computational reported show predictive performance provided by proposed solution approaches better than ones (linear and kernel) similar or Maldonado et al. (2018).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Support Vector Machine Soft Margin Classifiers: Error Analysis

The purpose of this paper is to provide a PAC error analysis for the q-norm soft margin classifier, a support vector machine classification algorithm. It consists of two parts: regularization error and sample error. While many techniques are available for treating the sample error, much less is known for the regularization error and the corresponding approximation error for reproducing kernel H...

متن کامل

Weighted Twin Support Vector Machine with Universum

Universum is a new concept proposed recently, which is defined to be the sample that does not belong to any classes concerned. Support Vector Machine with Universum (U-SVM) is a new algorithm, which can exploit Universum samples to improve the classification performance of SVM. In fact, samples in the different positions have different effects on the bound function. Then, we propose a weighted ...

متن کامل

Soft Margin Support Vector Classification as Buffered Probability Minimization

In this paper, we show that the popular C-SVM, soft-margin support vector classifier is equivalent to minimization of Buffered Probability of Exceedance (bPOE) by introducing a new SVM formulation, called the EC-SVM, which is derived as a bPOE minimization problem. Since it is derived from a simple bPOE minimization problem, the EC-SVM is simple to interpret with a meaningful free parameter, op...

متن کامل

A Fast Bounded Parametric Margin Model for Support Vector Machine

In this paper, a fast bounded parametric margin  -support vector machine (BP- SVM) for classification is proposed. Different from the parametric margin  -support vector machine (par- -SVM), the BP- -SVM maximizes a bounded parametric margin, and consequently the successive overrelaxation (SOR) technique could be used to solve our dual problem as opposed solving the standard quadratic progr...

متن کامل

Margin-based Feature Selection Techniques for Support Vector Machine Classification

Feature selection for classification working in high-dimensional feature spaces can improve generalization accuracy, reduce classifier complexity, and is also useful for identifying the important feature “markers”, e.g., biomarkers in a bioinformatics or biomedical context. For support vector machine (SVM) classification, a widely used feature selection technique is recursive feature eliminatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Knowledge Based Systems

سال: 2022

ISSN: ['1872-7409', '0950-7051']

DOI: https://doi.org/10.1016/j.knosys.2021.107705